A Solution Path Algorithm for General Parametric Quadratic Programming Problem
نویسندگان
چکیده
منابع مشابه
On the Solution of Parametric Bi-Level Quadratic Programming Problem
This paper presents a parametric bi-level quadratic programming problem with random rough coefficient in objective functions. An approach combines the convert technique of rough coefficient and Stackelberg strategy. An auxiliary problem is discussed and an algorithm as well as an example is presented.
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملTrace Solution Paths for SVMs via Parametric Quadratic Programming
The performance of SVM models often depends on the proper choice of their regularized parameter(s). Some recent researches have been focusing on efficiently building all SVM models against the regularized parameters, thus defining a task of tracing the regularized piecewise linear solution path for SVMs. It has been widely known from an optimization view many SVM types can be formulated into qu...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks and Learning Systems
سال: 2018
ISSN: 2162-237X,2162-2388
DOI: 10.1109/tnnls.2017.2771456